Step-2: Conversion of FOL into CNF
Eliminate all implication (→)
1.∀x ¬ food(x) V likes(John, x)
2.food(Apple) Λ food(vegetables)
3.∀x ∀y ¬ [eats(x, y) Λ ¬ killed(x)] V food(y)
4.eats (Anil, Peanuts) Λ alive(Anil)
5.∀x ¬ eats(Anil, x) V eats(Harry, x)
6.∀x¬ [¬ killed(x) ] V alive(x)
7.∀x ¬ alive(x) V ¬ killed(x)
8.likes(John, Peanuts).
Move negation (¬)inwards
1. ∀x ¬ food(x) V likes(John, x)
2. food(Apple) Λ food(vegetables)
3. ∀x ∀y ¬ eats(x, y) V killed(x) V food(y)
4. eats (Anil, Peanuts) Λ alive(Anil)
5. ∀x ¬ eats(Anil, x) V eats(Harry, x)
6. ∀x killed(x) ] V alive(x)
7. ∀x ¬ alive(x) V ¬ killed(x)
8. likes(John, Peanuts).